-
as seen on Stack Overflow
- Search for 'Stack Overflow'
What is the maximal acceptable asymptotic runtime of a general-purpose compiler?
For clarification: The complexity of compilation process itself, not of the compiled program. Depending on the program size, for instance, the number of source code characters, statements, variables, procedures, basic…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Indicates the Big-Theta g(n) for the function below and prove it
(n^2 + 1)^10
I don not know how to prove it.
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Its a exercise that ask to indicate the class Big-Theta(g(n)) the functions belongs to and to prove the assertion.
In this case f(n) = (n^2+1)^10
By definition f(n) E Big-Theta(g(n)) <= c1*g(n) < f(n) < c2*g(n), where c1 and c2 are two constants.
I know that for this specific f(n) the…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have a performance issue where I suspect one standard C library function is taking too long and causing my entire system (suite of processes) to basically "hiccup". Sure enough if I comment out the library function call, the hiccup goes away. This prompted me to investigate what standard methods…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Imagine you're in a tall building with a cat. The cat can survive a fall out of a low story window, but will die if thrown from a high floor. How can you figure out the longest drop that the cat can survive, using the least number of attempts?
Obviously, if you only have one cat, then you can only…
>>> More
